Перевод: со всех языков на русский

с русского на все языки

bijective correspondence

См. также в других словарях:

  • Bijective proof — In combinatorics, bijective proof is a proof technique that finds a bijective function f : A → B between two sets A and B , thus proving that they have the same number of elements, | A | = | B |. One place the technique is useful is where we wish …   Wikipedia

  • Quantum logic — In mathematical physics and quantum mechanics, quantum logic is a set of rules for reasoning about propositions which takes the principles of quantum theory into account. This research area and its name originated in the 1936 paper by Garrett… …   Wikipedia

  • Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… …   Wikipedia

  • Group isomorphism — In abstract algebra, a group isomorphism is a function between two groups that sets up a one to one correspondence between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two… …   Wikipedia

  • Robinson-Schensted algorithm — In mathematics, the Robinson ndash;Schensted algorithm is a combinatorial algorithm, first described by Robinson in 1938, which establishes a bijective correspondence between elements of the symmetric group S n and pairs of standard Young… …   Wikipedia

  • F-coalgebra — In mathematics, specifically in category theory, an F coalgebra is a structure defined according to a functor F. For both algebra and coalgebra, a functor is a convenient and general way of organizing a signature. This has applications in… …   Wikipedia

  • Extensions of symmetric operators — In functional analysis, one is interested in extensions of symmetric operators acting on a Hilbert space. Of particular importance is the existence, and sometimes explicit constructions, of self adjoint extensions. This problem arises, for… …   Wikipedia

  • Gelfand-Naimark-Segal construction — In functional analysis, given a C* algebra A , the Gelfand Naimark Segal construction establishes a correspondence between cyclic * representations of A and certain linear functionals on A (called states ). The correspondence is shown by an… …   Wikipedia

  • Matrix ring — In abstract algebra, a matrix ring is any collection of matrices forming a ring under matrix addition and matrix multiplication. The set of n×n matrices with entries from another ring is a matrix ring, as well as some subsets of infinite matrices …   Wikipedia

  • Operator (mathematics) — This article is about operators in mathematics. For other uses, see Operator (disambiguation). In basic mathematics, an operator is a symbol or function representing a mathematical operation. In terms of vector spaces, an operator is a mapping… …   Wikipedia

  • Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»